A numerical elimination method for polynomial computations
نویسندگان
چکیده
منابع مشابه
A numerical elimination method for polynomial computations
A numerical elimination method is presented in this paper for floating-point computation in polynomial algebra. The method is designed to calculate one or more polynomials in an elimination ideal by a sequence of matrix rank/kernel computation. The method is reliable in numerical computation with verifiable stability and a sensitivity measurement. Computational experiment shows that the method ...
متن کاملA descent method for explicit computations on curves
It is shown that the knowledge of a surjective morphism $Xto Y$ of complex curves can be effectively used to make explicit calculations. The method is demonstrated by the calculation of $j(ntau)$ (for some small $n$) in terms of $j(tau)$ for the elliptic curve with period lattice $(1,tau)$, the period matrix for the Jacobian of a family of genus-$2$ curves complementing the classi...
متن کاملNumerical Stability of Block Toeplitz Algorithms in Polynomial Matrix Computations
We study the problem of computing the eigenstructure of a polynomial matrix. Via a backward error analysis we analyze the stability of some block Toeplitz algorithms to obtain this eigenstructure. We also elaborate on the nature of the problem, i.e. conditioning and posedness. Copyright c ©2005 IFAC.
متن کاملNumerical Computations of the PCD Method
abstract: The PCD (piecewise constant distributions) method is a discretization technique of the boundary value problems in which the unknown distribution and its derivatives are represented by piecewise constant distributions but on distinct meshes. It has the advantage of producing the most sparse stiffness matrix resulting from the approximate problem. In this contribution, we propose a gene...
متن کاملA numerical method for polynomial eigenvalue problems using contour integral
We propose a numerical method using contour integral to solve polynomial eigenvalue problems (PEPs). The method finds eigenvalues contained in a certain domain which is defined by a surrounding integral path. By evaluating the contour integral numerically along the path, the method reduces the original PEP into a small generalized eigenvalue problem, which has the identical eigenvalues in the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.09.035